Online Traffic Engineering using Least Interference Optimization

Flow-based routing algorithms have recently been proposed where the online routing process uses a priori knowledge of the ingress-egress pairs and an estimation of the traffic profile to reduce LSP rejection in MPLS networks. This paper presents a new routing scheme referred to as Least Interference Optimization (LIO) where the online routing process uses the current bandwidth availability and the traffic flow distribution to achieve traffic engineering in IP networks. A Least Interference Optimization Algorithm (LIOA) is presented which balances the number and quantity of flows carried by a link to achieve efficient routing of MPLS bandwidth-guaranteed label-switched paths (LSPs). Preliminary simulation results show that LIOA outperforms several widely known routing algorithms including the Minimum Hop Algorithm (MHA), Shortest Path First (SPF), Constraint Shortest Path First (CSPF) and Minimum Interference Routing Algorithm (MIRA) on several performance parameters including (1) the LSP rejection and (2) the ease of implementation.